tool-augmented llm
QUASAR: Quantum Assembly Code Generation Using Tool-Augmented LLMs via Agentic RL
Yu, Cong, Uotila, Valter, Deng, Shilong, Wu, Qingyuan, Shi, Tuo, Jiang, Songlin, You, Lei, Zhao, Bo
Designing and optimizing task-specific quantum circuits are crucial to leverage the advantage of quantum computing. Recent large language model (LLM)-based quantum circuit generation has emerged as a promising automatic solution. However, the fundamental challenges remain unaddressed: (i) parameterized quantum gates require precise numerical values for optimal performance, which also depend on multiple aspects, including the number of quantum gates, their parameters, and the layout/depth of the circuits. Extensive evaluation shows improvements in both syntax and semantic performance of the generated quantum circuits. We release our model at HuggingFace and provide the training code at GitHub. Quantum hardware has improved remarkably in recent years (AI & Collaborators, 2025; Bravyi et al., 2024; Bluvstein et al., 2024) and this rapid hardware development creates demand for improved quantum software and algorithms. Quantum software and algorithms can be categorized into classical platforms that support quantum computers themselves, including quantum error mitigation software and quantum compilers. The second category comprises domain-specific quantum algorithms, including examples like Shor's algorithm and Grover's algorithm. At the core of quantum software and algorithms is the quantum circuit model (Nielsen & Chuang, 2010), which is an assembly-level abstraction for operating gate-based quantum computers. Most of the quantum algorithms can be expressed as quantum circuits (Jordan, 2025). The design of quantum circuits is the foundation in quantum compilers and quantum algorithm development.
SMARTAPS: Tool-augmented LLMs for Operations Management
Yu, Timothy Tin Long, Mostajabdaveh, Mahdi, Byusa, Jabo Serge, Ramamonjison, Rindra, Carenini, Giuseppe, Mao, Kun, Zhou, Zirui, Zhang, Yong
Large language models (LLMs) present intriguing opportunities to enhance user interaction with traditional algorithms and tools in real-world applications. An advanced planning system (APS) is a sophisticated software that leverages optimization to help operations planners create, interpret, and modify an operational plan. While highly beneficial, many customers are priced out of using an APS due to the ongoing costs of consultants responsible for customization and maintenance. To address the need for a more accessible APS expressed by supply chain planners, we present SmartAPS, a conversational system built on a tool-augmented LLM. Our system provides operations planners with an intuitive natural language chat interface, allowing them to query information, perform counterfactual reasoning, receive recommendations, and execute scenario analysis to better manage their operation. A short video demonstrating the system has been released: https://youtu.be/KtIrJjlDbyw
Tool Unlearning for Tool-Augmented LLMs
Tool-augmented large language models (LLMs) are often trained on datasets of query-response pairs, which embed the ability to use tools or APIs directly into the parametric knowledge of LLMs. Tool-augmented LLMs need the ability to forget learned tools due to security vulnerabilities, privacy regulations, or tool deprecations. However, ``tool unlearning'' has not been investigated in unlearning literature. We introduce this novel task, which requires addressing distinct challenges compared to traditional unlearning: knowledge removal rather than forgetting individual samples, the high cost of optimizing LLMs, and the need for principled evaluation metrics. To bridge these gaps, we propose ToolDelete, the first approach for unlearning tools from tool-augmented LLMs. It implements three key properties to address the above challenges for effective tool unlearning and introduces a new membership inference attack (MIA) model for effective evaluation. Extensive experiments on multiple tool learning datasets and tool-augmented LLMs show that ToolDelete effectively unlearns randomly selected tools, while preserving the LLM's knowledge on non-deleted tools and maintaining performance on general tasks.
LLM-dCache: Improving Tool-Augmented LLMs with GPT-Driven Localized Data Caching
Singh, Simranjit, Fore, Michael, Karatzas, Andreas, Lee, Chaehong, Jian, Yanan, Shangguan, Longfei, Yu, Fuxun, Anagnostopoulos, Iraklis, Stamoulis, Dimitrios
As Large Language Models (LLMs) broaden their capabilities to manage thousands of API calls, they are confronted with complex data operations across vast datasets with significant overhead to the underlying system. In this work, we introduce LLM-dCache to optimize data accesses by treating cache operations as callable API functions exposed to the tool-augmented agent. We grant LLMs the autonomy to manage cache decisions via prompting, seamlessly integrating with existing function-calling mechanisms. Tested on an industry-scale massively parallel platform that spans hundreds of GPT endpoints and terabytes of imagery, our method improves Copilot times by an average of 1.24x across various LLMs and prompting techniques.
ToolNet: Connecting Large Language Models with Massive Tools via Tool Graph
Liu, Xukun, Peng, Zhiyuan, Yi, Xiaoyuan, Xie, Xing, Xiang, Lirong, Liu, Yuchen, Xu, Dongkuan
While achieving remarkable progress in a broad range of tasks, large language models (LLMs) remain significantly limited in properly using massive external tools. Existing in-context learning approaches simply format tools into a list of plain text descriptions and input them to LLMs, from which, LLMs generate a sequence of tool calls to solve problems step by step. Such a paradigm ignores the intrinsic dependency between tools and offloads all reasoning loads to LLMs, making them restricted to a limited number of specifically designed tools. It thus remains challenging for LLMs to operate on a library of massive tools, casting a great limitation when confronted with real-world scenarios. This paper proposes ToolNet, a plug-and-play framework that scales up the number of tools to thousands with a moderate increase in token consumption. ToolNet organizes tools into a directed graph. Each node represents a tool, and weighted edges denote tool transition. Starting from an initial tool node, an LLM navigates in the graph by iteratively choosing the next one from its successors until the task is resolved. Extensive experiments show that ToolNet can achieve impressive results in challenging multi-hop tool learning datasets and is resilient to tool failures.
API-Bank: A Comprehensive Benchmark for Tool-Augmented LLMs
Li, Minghao, Zhao, Yingxiu, Yu, Bowen, Song, Feifan, Li, Hangyu, Yu, Haiyang, Li, Zhoujun, Huang, Fei, Li, Yongbin
Recent research has demonstrated that Large Language Models (LLMs) can enhance their capabilities by utilizing external tools. However, three pivotal questions remain unanswered: (1) How effective are current LLMs in utilizing tools? (2) How can we enhance LLMs' ability to utilize tools? (3) What obstacles need to be overcome to leverage tools? To address these questions, we introduce API-Bank, a groundbreaking benchmark, specifically designed for tool-augmented LLMs. For the first question, we develop a runnable evaluation system consisting of 73 API tools. We annotate 314 tool-use dialogues with 753 API calls to assess the existing LLMs' capabilities in planning, retrieving, and calling APIs. For the second question, we construct a comprehensive training set containing 1,888 tool-use dialogues from 2,138 APIs spanning 1,000 distinct domains. Using this dataset, we train Lynx, a tool-augmented LLM initialized from Alpaca. Experimental results demonstrate that GPT-3.5 exhibits improved tool utilization compared to GPT-3, while GPT-4 excels in planning. However, there is still significant potential for further improvement. Moreover, Lynx surpasses Alpaca's tool utilization performance by more than 26 pts and approaches the effectiveness of GPT-3.5. Through error analysis, we highlight the key challenges for future research in this field to answer the third question.